3-dimensional Chaotic Dynamics on Jacobian Elliptic Space Curve
نویسنده
چکیده
Sufficient conditions have been recently given for a classs of ergodic maps of an interval onto itself: I = [0, 1] ⊂ R1 → I and its associated binary function to generate a sequence of independent and idetically distributed (i.i.d.) random variables. Jacobian elliptic Chebyshev map, its derivative and second derivative induce Jacobian elliptic space curve. A mapping of the space curve onto itself: R3 → R3 is introduced which defines 3 projective onto mappings, represented in the form of rational functions of xn, yn, zn and gives a 3-dimensional sequence of i.i.d. random vectors.
منابع مشابه
Watermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملFour-Dimensional GLV via the Weil Restriction
The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over Fp which have the property that the corresponding Jacobians are (2, 2)isogenous over an extension field to a product of elliptic ...
متن کاملA descent method for explicit computations on curves
It is shown that the knowledge of a surjective morphism $Xto Y$ of complex curves can be effectively used to make explicit calculations. The method is demonstrated by the calculation of $j(ntau)$ (for some small $n$) in terms of $j(tau)$ for the elliptic curve with period lattice $(1,tau)$, the period matrix for the Jacobian of a family of genus-$2$ curves complementing the classi...
متن کامل